J´erˆome Leroux Least Significant Digit First Presburger Automata DRAFT. Please do not distribute, but contact the author for a version

Source URL: www.labri.fr

• Mathematics
• Algebra
• Mathematical logic
• Logic in computer science
• Model theory
• Proof theory
• Presburger arithmetic
• Time complexity
• Generalized arithmetic progression
• Polynomial
• Vector space
• Lattice

University of Warsaw Faculty of Mathematics, Informatics, and Mechanics Michał Skrzypczak Descriptive set theoretic methods in automata theory

Source URL: www.mimuw.edu.pl

ioco Theory for Probabilistic Automata M. Gerhold, M.I.A. Stoelinga10th MBT Workshop, London 2015

Source URL: www.mbt-workshop.org

Magnús Már Halldórsson ICE-TCS, School of Computer Science Reykjavik University 101 Reykjavik, Iceland

Source URL: www.ru.is

• Computational complexity theory
• NP-complete problems
• Combinatorial optimization
• Theoretical computer science
• Maximum cut
• Approximation algorithm
• International Colloquium on Automata
• Languages and Programming
• Algorithmica
• Halldrsson
• International Symposium on Algorithms and Computation
• European Symposium on Algorithms
• Graph coloring

Computation Power of Randomization and Nondeterminism 2 Scientific Work

Source URL: www.ite.ethz.ch

• Complexity classes
• Computational complexity theory
• Finite automata
• Models of computation
• Analysis of algorithms
• Nondeterminism
• NL
• Randomized algorithm
• Automata theory
• Theory of computation
• Communication complexity
• NP

ioco theory for probabilistic automata Marcus Gerhold Mariëlle Stoelinga University of Twente, Enschede, The Netherlands

Source URL: www.mbt-workshop.org

Research Overview Distributed Computing Generally speaking, we are interested in both theory and practice of computer science and information technology. In our group we cultivate a large breadth of areas, reflecting ou

Source URL: www.disco.ethz.ch

• Computing
• Wireless sensor network
• Computer science
• Distributed computing
• Symposium on Principles of Distributed Computing
• Conference on Embedded Networked Sensor Systems
• International Conference on Information Processing in Sensor Networks
• Symposium on Foundations of Computer Science
• Symposium on Theory of Computing
• International Colloquium on Automata
• Languages and Programming
• ACM SIGACT
• Dijkstra Prize

1 PASS: A Parallel Activity Search System Andrea Pugliese, V.S. Subrahmanian, Christopher Thomas, and Cristian Molinaro Abstract—Given a set A of activities expressed via temporal stochastic automata, and a set O of o

Source URL: www.cs.umd.edu

• Network theory
• Edsger W. Dijkstra
• Shortest path problem
• Dynamic programming

From grammars and automata to algebras and coalgebras Peter Padawitz Technical University of Dortmund, Germany April 2, 2013 Abstract. The increasing application of notions and results from category theory, especially fr

Source URL: fldit-www.cs.uni-dortmund.de

Beyond Big-Oh analysis in automata theory Javier Esparza Foundations of Software Reliability Group Technische Universität München Javier Esparza

Source URL: www7.in.tum.de